Random-Walk Closeness Centrality Satisfies Boldi-Vigna Axioms

نویسندگان

  • Ricardo Mora
  • Claudio Gutiérrez
چکیده

Recently Boldi and Vigna proposed axioms that would characterize good notions of centrality. We study a random-walk version of closeness centrality and prove that is satisfies Boldi-Vigna axioms for non-directed graphs.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Axioms for Centrality

Given a social network, which of its nodes are more central? This question has been asked many times in sociology, psychology and computer science, and a whole plethora of centrality measures (a.k.a. centrality indices, or rankings) were proposed to account for the importance of the nodes of a network. In this paper, we try to provide a mathematically sound survey of the most important classic ...

متن کامل

Online Estimating The Top k Nodes Of A Network

The goal of this paper is to estimate the top k central nodes in a network through parsimonious sampling, in an online fashion. We consider three centrality metrics: degree, betweenness, and closeness centrality. We identify and investigate through simulations the contributions of two sources of error in finding central nodes: (1) sampling (collection) error and (2) identification error. Sampli...

متن کامل

An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs

In recent years, researchers proposed several algorithms that compute metric quantities of real-world complex networks, and that are very efficient in practice, although there is no worstcase guarantee. In this work, we propose an axiomatic framework to analyze the performances of these algorithms, by proving that they are efficient on the class of graphs satisfying certain axioms. Furthermore,...

متن کامل

Correlation of Eigenvector Centrality to Other Centrality Measures: Random, Small-world and Real-world Networks

In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality measures, including degree centrality, betweenness centrality, clustering coefficient centrality, closeness centrality, and farness centrality, of various types of network (random network, smallworld network, and real-world network). For each network, we compute those six centrality measures, from...

متن کامل

Random walk centrality in interconnected multilayer networks

Real-world complex systems exhibit multiple levels of relationships. In many cases they require to be modeled as interconnected multilayer networks, characterizing interactions of several types simultaneously. It is of crucial importance in many fields, from economics to biology and from urban planning to social sciences, to identify the most (or the less) influent nodes in a network using cent...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015